منابع مشابه
Speeding Up Inference for Probabilistic Logic Programs
Probabilistic Logic Programming (PLP) allows to represent domains containing many entities connected by uncertain relations and has many applications in particular in Machine Learning. PITA is a PLP algorithm for computing the probability of queries that exploits tabling, answer subsumption and Binary Decision Diagrams (BDDs). PITA does not impose any restriction on the programs. Other algorith...
متن کامل2 Inductively Speeding Up Logic Programs
This paper presents a speed-up learning method for logic programs, which accelerates a program by composing macro clauses based on partial structures of proof trees. Many systems have been proposed for composing useful macros, e.g., some of them select macros that connects two peaks in a heuristic function. Another employs heuristics that select useful macros. Although they work well in some do...
متن کاملSpeeding - up Logic Programs by Combining EBG and FOIL
This paper presents an algorithm that combines traditional EBL techniques and recent developments in inductive logic programming to learn e ective clause selection rules for Prolog programs. When these control rules are incorporated into the original program, signi cant speed-up may be achieved. The algorithm produces not only EBL-like speed up of problem solvers, but is capable of automaticall...
متن کاملSpeeding up snakes
In this paper we summarize new and existing approaches for the semiautomatic image segmentation based on active contour models. In order to replace the manual segmentation of images of the medical research of the Center of Anatomy at the Georg August University of Göttingen we developed a user interface based on snakes. Due to the huge images (sometimes bigger than 100 megapixels) the research ...
متن کاملSpeeding up Dynamic Programming
A number of important computational problems in molecular biology, geology, speech recognition, and other areas, can be expressed as recurrences which have typically been solved with dynamic programming. By using more sophisticated data structures, and by taking advantage of further structure from the applications, we speed up the computation of several of these recurrences by one or two orders...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1974
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/17.4.337